Vision-Aided Path Planning Using Low-Cost Gene Encoding for a Mobile Robot
نویسندگان
چکیده
Path planning is intrinsically regarded as a multi-objective optimization problem (MOOP) that simultaneously optimizes the shortest path and least collision-free distance to obstacles. This work develops novel optimized approach using genetic algorithm (GA) drive evolutionary (MOEA) for of mobile robot in given finite environment. To represent positions integer-type genes chromosome GA, grid-based method also introduced relax complex environment simple map. The system architecture composed robot, embedded with operating (ROS), ArUco laptop, executing algorithms image processing. Both simulations experimental results are presented verify feasibility proposed method. In applications, this can be employed commercial ball-collecting or an object-carrying robot.
منابع مشابه
Mobile Robot Path Planning Using Genetic Algorithms
Genetic Algorithms (GAs) have demonstrated to be effective procedures for solving multicriterion optimization problems. These algorithms mimic models of natural evolution and have the ability to adaptively search large spaces in near-optimal ways. One direct application of this intelligent technique is in the area of evolutionary robotics, where GAs are typically used for designing behavioral c...
متن کاملPath Planning for a Mobile Robot Using Genetic Algorithms
This paper presents a new algorithm for global path planning to a goal for a mobile robot using Genetic Algorithm (GA). A genetic algorithm is used to find the optimal path for a mobile robot to move in a static environment expressed by a map with nodes and links. Locations of target and obstacles to find an optimal path are given in an environment that is a 2-D workplace. Each via point (landm...
متن کاملVision-Motion Planning of a Mobile Robot considering Vision Uncertainty and Planning Cost
This paper proposes a planning method for a vision-guided mobile robot under vision uncertainty and limited computational resources. The method considers the following two tradeo s: (1) granularity in approximating a probabilistic distribution vs. plan quality, and (2) search depth vs. plan quality. The rst tradeo is managed by predicting the plan quality for a granularity using a learned relat...
متن کاملPath Relaxation: Path Planning for a Mobile Robot
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...
متن کاملPath Following and Velocity Optimizing for an Omnidirectional Mobile Robot
In this paper, the path following controller of an omnidirectional mobile robot (OMR) has been extended in such a way that the forward velocity has been optimized and the actuator velocity constraints have been taken into account. Both have been attained through the proposed model predictive control (MPC) framework. The forward velocity has been included into the objective function, while the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Automation and Soft Computing
سال: 2022
ISSN: ['2326-005X', '1079-8587']
DOI: https://doi.org/10.32604/iasc.2022.022067